On the Wiener Index of Unicyclic Graphs
نویسندگان
چکیده
The Wiener index of a graph G is defined as W (G) = ∑ u,v dG(u, v), where dG(u, v) is the distance between u and v in G, and the sum goes over all pairs of vertices. In this paper, we characterize the connected unicyclic graph with minimum Wiener indices among all connected unicyclic graphs of order n and girth g with k pendent vertices.
منابع مشابه
On the Eccentric Connectivity Index of Unicyclic Graphs
In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.
متن کاملThe Wiener Index of Unicyclic Graphs with Girth and Matching Number
In this paper, we investigate how the Wiener index of unicyclic graphs varies with graph operations. These results are used to present a sharp lower bound for the Wiener index of unicyclic graphs of order n with girth and the matching number β ≥ 3g 2 . Moreover, we characterize all extremal graphs which attain the lower bound.
متن کاملThe hyper-Wiener index of unicyclic graphs with given matching number
We determine the minimum hyper-Wiener index of unicyclic graphs with given number of vertices and matching number, and characterize the extremal graphs. Mathematics Subject Classification (2010): 05C12, 05C35, 05C90.
متن کاملOn the Extremal Wiener Polarity Index of Hückel Graphs
Graphs are used to model chemical compounds and drugs. In the graphs, each vertex represents an atom of molecule and edges between the corresponding vertices are used to represent covalent bounds between atoms. The Wiener polarity index W p (G) of a graph G is the number of unordered pairs of vertices u, v of G such that the distance between u and v is equal to 3. The trees and unicyclic graphs...
متن کاملMinimum Wiener Indices of Trees and Unicyclic Graphs of given Matching Number
The Wiener index of a connected graph is defined as the sum of distances between all unordered pairs of its vertices. We determine the minimum Wiener indices of trees and unicyclic graphs with given number of vertices and matching number, respectively. The extremal graphs are characterized.
متن کامل